Maximality of the sum of a maximally monotone linear relation and a maximally monotone operator Dedicated to Petar Kenderov on the occasion of his seventieth birthday
نویسندگان
چکیده
The most famous open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar’s constraint qualification holds. In this paper, we prove the maximal monotonicity of A+B provided that A,B are maximally monotone and A is a linear relation, as soon as Rockafellar’s constraint qualification holds: domA ∩ int domB 6= ∅. Moreover, A+B is of type (FPV). 2010 Mathematics Subject Classification: Primary 47A06, 47H05; Secondary 47B65, 47N10, 90C25
منابع مشابه
Monotone Operators without Enlargements
Enlargements have proven to be useful tools for studying maximally monotone mappings. It is therefore natural to ask in which cases the enlargement does not change the original mapping. Svaiter has recently characterized non-enlargeable operators in reflexive Banach spaces and has also given some partial results in the nonreflexive case. In the present paper, we provide another characterization...
متن کاملMaximality of the sum of the subdifferential operator and a maximally monotone operator
The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that the classical Rockafellar’s constraint qualification holds, which is called the “sum problem”. In this paper, we establish the maximal monotonicity of A+ B provided that A and B are maximally monotone operators such that domA ∩ int domB 6= ∅,...
متن کاملA primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators
We consider the primal problem of finding the zeros of the sum of a maximally monotone operator with the composition of another maximally monotone operator with a linear continuous operator and a corresponding dual problem formulated by means of the inverse operators. A primal-dual splitting algorithm which simultaneously solves the two problems in finite-dimensional spaces is presented. The sc...
متن کاملThe sum of a maximally monotone linear relation and the subdifferential of a proper lower semicontinuous convex function is maximally monotone
The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar’s constraint qualification holds. In this paper, we prove the maximal monotonicity of A + ∂f provided that A is a maximally monotone linear relation, and f is a proper lower semicontinuous convex function satisfying domA ∩ int dom...
متن کاملThe sum of two maximal monotone operator is of type FPV
In this paper, we studied maximal monotonicity of type FPV for sum of two maximal monotone operators of type FPV and the obtained results improve and complete the corresponding results of this filed.
متن کامل